Optimistically Parallelizing Parallel Search Processes
نویسندگان
چکیده
منابع مشابه
Parallel and serial processes in visual search.
A long-standing issue in the study of how people acquire visual information centers around the scheduling and deployment of attentional resources: Is the process serial, or is it parallel? A substantial empirical effort has been dedicated to resolving this issue (e.g., J. M. Wolfe, 1998a, 1998b). However, the results remain largely inconclusive because the methodologies that have historically b...
متن کاملA Checkpointing-Recovery Scheme for Optimistically Synchronized Parallel Computations
This paper presents a checkpointing-recovery scheme for optimistically synchronized parallel computations. The scheme relies on a checkpointing protocol, namely hybrid state saving, embedding both sparse and incremental state saving modes, and on a state recovery procedure embedding both forward and backward recovery modes. This scheme is a generalization of many previous solutions, which can b...
متن کاملAn Analysis of the Efficiency of Optimistically Synchronized Parallel Simulators
In optimistically synchronized parallel simulators logical processes execute events greedily and recovery from timestamp order violations is based on rollback. These type of simulators have shown the potential to exploit a high degree of parallelism; however, they may result ineecient due to possible unacceptable percentage of CPU time spent executing events that are rolled back (i.e., non prod...
متن کاملParallelizing Combinatorial Search in Shared Memory
The Langford’s problem is a typical hard combinatorial problem. The last open instance to be solved took one week CPU time on a pool of 3 PCs with a quite specific search algorithm in 2002. It represents a real challenging problem especially for Parallel Combinatorial Search. The paper presents a general framework for parallel resolution of combinatorial problems formulated as Constraint Satisf...
متن کاملSearch-Space Partitioning for Parallelizing SMT Solvers
The Satisfiability Modulo Theories (SMT) problem is the decision problem of determining whether a propositional formula is satisfiable, given that some of the variables have an interpretation with respect to background theories. The expressiveness of SMT makes it suitable for a vast range of application domains, and for that reason it has recently attained significant interest from both industr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ICGA Journal
سال: 2013
ISSN: 1389-6911,2468-2438
DOI: 10.3233/icg-2013-36208